Minimum cost source location problem with local 3-vertex-connectivity requirements
نویسندگان
چکیده
منابع مشابه
Minimum Cost Source Location Problem with Local 3-Vertex-Connectivity Requirements
Let G = (V, E) be a simple undirected graph with a set V of vertices and a set E of edges. Each vertex v ∈ V has a demand d(v) ∈ Z+ and a cost c(v) ∈ R+, where Z+ and R+ denote the set of nonnegative integers and the set of nonnegative reals, respectively. The source location problem with vertex-connectivity requirements in a given graph G asks to find a set S of vertices minimizing ∑ v∈S c(v) ...
متن کاملThe source location problem with local 3-vertex-connectivity requirements
Let G = (V, E) be a simple undirected graph with a set V of vertices and a set E of edges. Each vertex v ∈ V has an integer valued demand d(v) ≥ 0. The source location problem with vertex-connectivity requirements in a given graph G asks to find a set S of vertices with the minimum cardinality such that there are at least d(v) vertex disjoint paths between S and each vertex v ∈ V − S. In this p...
متن کاملApproximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands
The source location problem is a problem of computing a minimum cost source set in an undirected graph so that the connectivity between the source set and a vertex is at least the demand of the vertex. In this paper, the connectivity between a source set S and a vertex v is defined as the maximum number of paths between v and S no two of which have common vertex except v. We propose an O(d∗ log...
متن کاملGreedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs
Let G = (V, E) be a simple undirected graph with a set V of vertices and a set E of edges. Each vertex v ∈ V has a demand d(v) ∈ Z+, and a cost c(v) ∈ R+, where Z+ and R+ denote the set of nonnegative integers and the set of nonnegative reals, respectively. The source location problem with vertex-connectivity requirements in a given graph G asks to find a set S of vertices minimizing ∑ v∈S c(v)...
متن کاملGreedy Approximation for the Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs ?
Let G = (V, E) be a simple undirected graph with a set V of vertices and a set E of edges. Each vertex v ∈ V has a demand d(v) ∈ Z+, and a cost c(v) ∈ R+, where Z+ and R+ denote the set of nonnegative integers and the set of nonnegative reals, respectively. The source location problem with vertex-connectivity requirements in a given graph G asks to find a set S of vertices minimizing ∑ v∈S c(v)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.11.010